Complexity of Source-Sink Monotone 2-parameter min cut

نویسندگان

چکیده

There are many applications of max flow with capacities that depend on one or more parameters. Many these fall into the “Source-Sink Monotone” framework, a special case Topkis's monotonic optimization which implies parametric min cuts nested. When there is single parameter, this property number distinct linear in nodes, quite useful for constructing algorithms to identify all possible cuts. multiple Source-Sink Monotone parameters, and vectors parameters ordered usual vector sense, resulting still However, was an open question. We show even only two can be exponential nodes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity of the Min-Max (Regret) Versions of Cut Problems

This paper investigates the complexity of the min-max and min-max regret versions of the s− t min cut and min cut problems. Even if the underlying problems are closely related and both polynomial, we show that the complexity of their min-max and min-max regret versions, for a constant number of scenarios, are quite contrasted since they are respectively strongly NP-hard and polynomial. Thus, we...

متن کامل

Lecture 2 : Karger ’ s Min Cut Algorithm

(These notes are a slightly modified version of notes from previous offerings of the class scribed by Sanjeev.) Today’s topic is simple but gorgeous: Karger’s min cut algorithm and its extension. It is a simple randomized algorithm for finding the minimum cut in a graph: a subset of vertices S in which the set of edges leaving S, denoted E(S, S) has minimum size among all subsets. You may have ...

متن کامل

Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem

Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...

متن کامل

Complexity of the min-max (regret) versions of min cut problems

This paper investigates the complexity of the min-max and min-max regret versions of the min s-t cut and min cut problems. Even if the underlying problems are closely related and both polynomial, the complexity of their min-max and min-max regret versions, for a constant number of scenarios, is quite contrasted since they are respectively strongly NP hard and polynomial. However, for a non cons...

متن کامل

Min-Max Multiway Cut

We propose the Min-max multiway cut problem, a variant of the traditional Multiway cut problem, but with the goal of minimizing the maximum capacity (rather than the sum or average capacity) leaving a part of the partition. The problem is motivated by data partitioning in Peer-to-Peer networks. The min-max objective function forces the solution not to overload any given terminal, and hence may ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research Letters

سال: 2022

ISSN: ['0167-6377', '1872-7468']

DOI: https://doi.org/10.1016/j.orl.2021.12.009